Evaluating the effectiveness of pointer alias analyses

نویسندگان

  • Michael Hind
  • Anthony Pioli
چکیده

This paper describes an empirical comparison of the e ectiveness of six context-insensitive pointer analysis algorithms that use varying degrees of ow-sensitivity. Four of the algorithms are ow-insensitive, one is ow-sensitive, and another is ow-insensitive, but uses precomputed ow-sensitive information. The e ectiveness of each analysis is quanti ed in terms of compile-time e ciency and precision. E ciency is reported by measuring CPU time and memory consumption of each analysis. Precision is reported by measuring the computed solutions at the program points where a pointer is dereferenced. The results of this paper will help implementors determine which pointer analysis is appropriate for their application. c © 2001 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimating the Impact of Scalable Pointer Analysis on Optimization

This paper addresses the following question: Do scalable control-flow-insensitive pointer analyses provide the level of precision required to make them useful in compiler optimizations? We first describe alias frequency, a metric that measures the ability of a pointer analysis to determine that pairs of memory accesses in C programs cannot be aliases. We believe that this kind of information is...

متن کامل

Instance keys: A technique for sharpening whole-program pointer analyses with intraprocedural information

Pointer analyses enable many subsequent program analyses and transformations, since they enable compilers to statically disambiguate references to the heap. Extra precision enables pointer analysis clients to draw stronger conclusions about programs. Flow-sensitive pointer analyses are typically quite precise. Unfortunately, flow-sensitive pointer analyses are also often too expensive to run on...

متن کامل

Ibm Research Report Combining Interprocedural Pointer Analysis and Conditional Constant Propagation Combining Interprocedural Pointer Analysis and Conditional Constant Propagation ?

LIMITED DISTRIBUTION NOTICE This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and spe...

متن کامل

Boomerang: Demand-Driven Flow- and Context-Sensitive Pointer Analysis for Java

Many current program analyses require highly precise pointer information about small, targeted parts of a given program. This motivates the need for demand-driven pointer analyses that compute information only where required. Pointer analyses generally compute points-to sets of program variables or answer boolean alias queries. However, many client analyses require richer pointer information. F...

متن کامل

On the Complexity of Function Pointer May-Alias Analysis

This paper considers the complexity of interprocedural function pointer may-alias analysis, i.e., determining the set of functions that a function pointer (in a language such as C) can point to at a point in a program. This information is necessary, for example, in order to construct the control ow graphs of programs that use function pointers, which in turn is fundamental for most data ow anal...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Sci. Comput. Program.

دوره 39  شماره 

صفحات  -

تاریخ انتشار 2001